Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
نویسندگان
چکیده
منابع مشابه
Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey
The just-in-time production philosophy has led to a growing interest in scheduling problems considering both earliness and tardiness penalties. Most publications considering these so-called non-regular objective functions are devoted to single machine problems. In the case of multi-machine problems, there are some papers dealing with parallel machine problems. However, for multi-operation sched...
متن کاملThe Unrelated Parallel Machine Scheduling Problem with Earliness and Tardiness Penalties and Job Splitting
This article deals with a quite complex machine scheduling problem comprising the following features: 1. unrelated parallel machines; 2. jobs have different due dates; 3. job splitting is allowed; 4. setup times are sequence dependent; 5. the objective function is to minimize the weighted sum of early, tardy and setup costs. The problem is formulated as a mixed-integer programming model which i...
متن کاملCommon due date scheduling problem with separate earliness and tardiness penalties
This paper considers the problem of linding an optimal schedule and a common due date for a set of jobs, in a static single machine system. The scheduling criterion is the minimization of the weighted sum of earliness and tardiness values. Different weights are considered as the earliness penalty and tardiness penalty, for each job. A branching procedure is presented for finding an optimal solu...
متن کاملSingle Machine Common Due Date with Job Dependent Earliness and Tardiness Penalties Problem Using Neural Network
We consider the problem of scheduling of n jobs to minimize the total earliness and tardiness penalty. The scheduling objective is to minimize the sum of job dependent earliness and tardiness penalties.. After determining the scheduling for single machine common due date, using neural network, the result shows that the neural network solution performs very well.
متن کاملMeta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine schedulingwith a common due date
This study addresses a class of single-machine scheduling problems involving a common due date where the objective is to minimize the total job earliness and tardiness penalties. A genetic algorithm (GA) approach and a simulated annealing (SA) approach utilizing a greedy local search and three well-known properties in the area of common due date scheduling are developed. The developed algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2001
ISSN: 0895-7177
DOI: 10.1016/s0895-7177(00)00250-8